Control of Fork-Join Processing Networks with Multiple Job Types and Parallel Shared Resources

Generalized parallel-server fork-join queues with dynamic task scheduling

This paper introduces a generalization of the classical parallel-server fork-join queueing system in which arriving customers fork into multiple tasks, every task is uniquely assigned to one of the set of single-server queues, and each task consists of multiple iterations of different stages of execution, including task vacations and communication among sibling tasks. Several classes of dynamic...

Estimated Returns to Scale with Interval Data in Parallel Manufacturing Systems with Shared Resources

Perfect Sampling for Fork-Join networks

In this paper, we show how to design a perfect simulation for Markovian fork-join networks, or equivalently, free-choice Petri nets. For pure fork-join networks and for event graphs, the simulation time can be greatly reduced by using extremal initial states, namely blocking states, although such nets do not exhibit any natural monotonicity property. Another approach for perfect simulation of p...

Queueing Networks with Shared Resources

All rights reserved. No part of this publication may be reproduced in any form or by any electronic or mechanical means (including photocopying, recording, or information storage and retrieval systems) without permission in writing from the author. CONTENTS Dankwoord i Contents iii 1 Introduction 1 1.

Assigning Multiple Job Types to Parallel Specialized Servers

In this paper methods of mixing decision rules are investigated and applied to the so-called multiple job type assignment problem with specialized servers which is modeled as continuous time Markov decision process. Performance optimization is difficult for this assignment problem, but optimization over the class of static policies is tractable. By applying the described mixing methods a suitab...